A Novel Heuristic Emergency Path Planning Method Based on Vector Grid Map
نویسندگان
چکیده
منابع مشابه
A Guide to Heuristic-based Path Planning
We describe a family of recently developed heuristicbased algorithms used for path planning in the real world. We discuss the fundamental similarities between static algorithms (e.g. A*), replanning algorithms (e.g. D*), anytime algorithms (e.g. ARA*), and anytime replanning algorithms (e.g. AD*). We introduce the motivation behind each class of algorithms, discuss their use on real robotic sys...
متن کاملA Novel Offline Path Planning Method
This paper investigates a novel offline path planner for single point robots in cluttered environments. In order to achieve the best results in building shortest collision free trajectory lengths from initial to the goal configuration, we considered a multi-layer solution in the form of a unique algorithm that works as a unit on workspace elements such as obstacles and determines proper traject...
متن کاملAccelerated A* Trajectory Planning: Grid-based Path Planning Comparison
The contribution of the paper is a high performance pathplanning algorithm designed to be used within a multi-agent planning framework solving a UAV collision avoidance problem. Due to the lack of benchmark examples and available algorithms for 3D+time planning, the algorithm performance has been compared in the classical domain of path planning in grids with blocked and unblocked cells. The Ac...
متن کاملThe Grid-Based Path Planning Competition
A large number of papers have been written that deal with path planning in grids. These papers contain a wide variety of techniques and operate under a wide variety of constraints. All of them offer significant improvement over and beyond a basic A* search. But there has been no unified study comparing techniques and measuring the trade-offs implicit in the approaches. While this comparison cou...
متن کاملGrid-Based Angle-Constrained Path Planning
Square grids are commonly used in robotics and game development as spatial models and well known in AI community heuristic search algorithms (such as A*, JPS, Theta* etc.) are widely used for path planning on grids. A lot of research is concentrated on finding the shortest (in geometrical sense) paths while in many applications finding smooth paths (rather than the shortest ones but containing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS International Journal of Geo-Information
سال: 2021
ISSN: 2220-9964
DOI: 10.3390/ijgi10060370